<?xml version='1.0' encoding='iso-8859-1'?>
<!doctype html public '-//W3C//DTD XHTML 1.0 Strict//EN' 'http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd'>
<html xmlns='http://www.w3c.org/1999/xhtml' lang='en-us'>
	<head>
		<title>
			pibruin.c
			</title>
		<meta http-equiv='content-type' content='text/html;iso-8859-1'/>
		<meta name='generator' content='motley-tools 1.9.4 13:40:33 Feb 18 2015'/>
		<meta name='author' content='cmaier@cmassoc.net'/>
		<meta name='robots' content='noindex,nofollow'/>
		<link href='toolkit.css' rel='stylesheet' type='text/css'/>
		</head>
	<body>
		<div class='headerlink'>
			[<a href='pibruin1.c.html' title=' pibruin1.c '>PREV</a>]
			[<a href='toolkit.html' title=' Index '>HOME</a>]
			[<a href='pibrump.c.html' title=' pibrump.c '>NEXT</a>]
			</div>
<pre>
/*====================================================================*
 *
 *   Copyright (c) 2013 Qualcomm Atheros, Inc.
 *
 *   All rights reserved.
 *
 *   Redistribution and use in source and binary forms, with or 
 *   without modification, are permitted (subject to the limitations 
 *   in the disclaimer below) provided that the following conditions 
 *   are met:
 *
 *   * Redistributions of source code must retain the above copyright 
 *     notice, this list of conditions and the following disclaimer.
 *
 *   * Redistributions in binary form must reproduce the above 
 *     copyright notice, this list of conditions and the following 
 *     disclaimer in the documentation and/or other materials 
 *     provided with the distribution.
 *
 *   * Neither the name of Qualcomm Atheros nor the names of 
 *     its contributors may be used to endorse or promote products 
 *     derived from this software without specific prior written 
 *     permission.
 *
 *   NO EXPRESS OR IMPLIED LICENSES TO ANY PARTY'S PATENT RIGHTS ARE 
 *   GRANTED BY THIS LICENSE. THIS SOFTWARE IS PROVIDED BY THE 
 *   COPYRIGHT HOLDERS AND CONTRIBUTORS &quot;AS IS&quot; AND ANY EXPRESS OR 
 *   IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED 
 *   WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 
 *   PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER 
 *   OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 
 *   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 
 *   NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; 
 *   LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 
 *   HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 
 *   CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE 
 *   OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS 
 *   SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.  
 *
 *--------------------------------------------------------------------*/

/*====================================================================*
 *
 *   pibruin.c - Atheros Classification Rule Insert Utility;
 *
 *
 *   Contributor(s):
 *      Nathaniel Houghton &lt;nhoughto@qca.qualcomm.com&gt;
 *      Charles Maier &lt;cmaier@qca.qualcomm.com&gt;
 *
 *--------------------------------------------------------------------*/

/*====================================================================*&quot;
 *   system header files;
 *--------------------------------------------------------------------*/

#include &lt;ctype.h&gt;
#include &lt;stdio.h&gt;
#include &lt;unistd.h&gt;
#include &lt;stdlib.h&gt;
#include &lt;stdint.h&gt;
#include &lt;string.h&gt;
#include &lt;netinet/in.h&gt;
#include &lt;arpa/inet.h&gt;

/*====================================================================*
 *   custom header files;
 *--------------------------------------------------------------------*/

#include &quot;../tools/getoptv.h&quot;
#include &quot;../tools/memory.h&quot;
#include &quot;../tools/number.h&quot;
#include &quot;../tools/symbol.h&quot;
#include &quot;../tools/chars.h&quot;
#include &quot;../tools/types.h&quot;
#include &quot;../tools/flags.h&quot;
#include &quot;../tools/files.h&quot;
#include &quot;../tools/error.h&quot;
#include &quot;../plc/rules.h&quot;
#include &quot;../nvm/nvm.h&quot;
#include &quot;../pib/pib.h&quot;

/*====================================================================*
 *   custom source files;
 *--------------------------------------------------------------------*/

#ifndef MAKEFILE
#include &quot;../tools/getoptv.c&quot;
#include &quot;../tools/putoptv.c&quot;
#include &quot;../tools/version.c&quot;
#include &quot;../tools/lookup.c&quot;
#include &quot;../tools/reword.c&quot;
#include &quot;../tools/hexstring.c&quot;
#include &quot;../tools/hexdecode.c&quot;
#include &quot;../tools/fdchecksum32.c&quot;
#include &quot;../tools/checksum32.c&quot;
#include &quot;../tools/memout.c&quot;
#include &quot;../tools/assist.c&quot;
#include &quot;../tools/bytespec.c&quot;
#include &quot;../tools/basespec.c&quot;
#include &quot;../tools/ipv4spec.c&quot;
#include &quot;../tools/ipv6spec.c&quot;
#include &quot;../tools/emalloc.c&quot;
#include &quot;../tools/todigit.c&quot;
#include &quot;../tools/codelist.c&quot;
#include &quot;../tools/getargv.c&quot;
#include &quot;../tools/error.c&quot;
#endif

#ifndef MAKEFILE
#include &quot;../pib/pibfile1.c&quot;
#include &quot;../pib/piblock.c&quot;
#if defined (PRINT_RULES) || defined (PRINT_CLASSIFIERS)
#include &quot;../pib/ruledump.c&quot;
#endif
#endif

#ifndef MAKEFILE
#include &quot;../nvm/nvmseek2.c&quot;
#endif

#ifndef MAKEFILE
#include &quot;../plc/ParseRule.c&quot;
#include &quot;../plc/rules.c&quot;
#endif

/*====================================================================*
 *   program constants;
 *--------------------------------------------------------------------*/

#define PIB_OFFSET1 0x0228
#define PIB_OFFSET2 0x0760

/*====================================================================*
 *
 *   signed pibimage1 (signed fd, char const * filename, unsigned offset, struct PIBClassifiers * classifiers);
 *
 *   read thunderbolt/lightning parameter block into memory, edit it
 *   and save it;
 *
 *
 *   Contributor(s):
 *	Charles Maier &lt;cmaier@qca.qualcomm.com&gt;
 *
 *--------------------------------------------------------------------*/

static signed pibimage1 (signed fd, char const * filename, unsigned offset, struct PIBClassifiers * classifiers)

{
	struct pib_header * pib_header;
	off_t extent;
	void * memory;
	if ((extent = lseek (fd, 0, SEEK_END)) == -1)
	{
		error (1, errno, FILE_CANTSIZE, filename);
	}
	if (!(memory = malloc (extent)))
	{
		error (1, errno, FILE_CANTLOAD, filename);
	}
	if (lseek (fd, 0, SEEK_SET))
	{
		error (1, errno, FILE_CANTHOME, filename);
	}
	if (read (fd, memory, extent) != extent)
	{
		error (1, errno, FILE_CANTREAD, filename);
	}
	if (lseek (fd, 0, SEEK_SET))
	{
		error (1, errno, FILE_CANTHOME, filename);
	}
	memcpy ((byte *)(memory) + offset, classifiers, sizeof (*classifiers));
	pib_header = (struct pib_header *)(memory);
	pib_header-&gt;CHECKSUM = checksum32 (memory, extent, pib_header-&gt;CHECKSUM);
	if (write (fd, memory, extent) != extent)
	{
		error (1, errno, FILE_CANTSAVE, filename);
	}
	if (lseek (fd, (off_t)(0) - extent, SEEK_CUR) == -1)
	{
		error (1, errno, FILE_CANTHOME, filename);
	}
	free (memory);
	close (fd);
	return (0);
}

/*====================================================================*
 *
 *   signed pibimage2 (signed fd, char const * filename, struct nvm_header2 * nvm_header, unsigned offset, struct PIBClassifiers * classifiers);
 *
 *   read panther/lynx parameter block into memory, edit it and save
 *   it;
 *
 *
 *   Contributor(s):
 *	Charles Maier &lt;cmaier@qca.qualcomm.com&gt;
 *
 *--------------------------------------------------------------------*/

static signed pibimage2 (signed fd, char const * filename, struct nvm_header2 * nvm_header, unsigned offset, struct PIBClassifiers * classifiers)

{
	void * memory;
	off_t extent = LE32TOH (nvm_header-&gt;ImageLength);
	if (!(memory = malloc (extent)))
	{
		error (1, errno, FILE_CANTLOAD, filename);
	}
	if (read (fd, memory, extent) != extent)
	{
		error (1, errno, FILE_CANTREAD, filename);
	}
	if (lseek (fd, (off_t)(0) - extent, SEEK_CUR) == -1)
	{
		error (1, errno, FILE_CANTHOME, filename);
	}
	memcpy ((byte *)(memory) + offset, classifiers, sizeof (*classifiers));
	nvm_header-&gt;ImageChecksum = checksum32 (memory, extent, 0);
	if (write (fd, memory, extent) != extent)
	{
		error (1, errno, FILE_CANTSAVE, filename);
	}
	if (lseek (fd, (off_t)(0) - extent, SEEK_CUR) == -1)
	{
		error (1, errno, FILE_CANTHOME, filename);
	}
	nvm_header-&gt;HeaderChecksum = checksum32 (nvm_header, sizeof (* nvm_header), nvm_header-&gt;HeaderChecksum);
	if (lseek (fd, (off_t)(0) - sizeof (* nvm_header), SEEK_CUR) == -1)
	{
		error (1, errno, FILE_CANTHOME, filename);
	}
	if (write (fd, nvm_header, sizeof (* nvm_header)) != sizeof (* nvm_header))
	{
		error (1, errno, FILE_CANTSAVE, filename);
	}
	if (lseek (fd, (off_t)(0) - sizeof (* nvm_header), SEEK_CUR) == -1)
	{
		error (1, errno, FILE_CANTHOME, filename);
	}
	free (memory);
	return (0);
}

/*====================================================================*
 *
 *   void make_rule (int argc, char const * argv [], struct PIBClassifiers * classifiers);
 *
 *   read argv [] and populate struct MMEClassifiers with QCA PLC
 *   classifier rules; function ParseRule converts each rule to an
 *   MMERule; we then convert that into one of two formats used to
 *   store classifier rules in the PIB;
 *
 *
 *--------------------------------------------------------------------*/

static void make_rule (int argc, char const * argv [], struct PIBClassifiers * classifiers)

{
	static char const * optv [] =
	{
		&quot;T:V:&quot;,
		&quot;&quot;,
		&quot;Atheros Classification Rule Insert Utility&quot;,
		&quot;T\ttag&quot;,
		&quot;V\tversion&quot;,
		(char const *) (0)
	};
	struct MMERule rule;
	struct cspec cspec;
	signed c;
	optind = 1;
	memset (&amp;rule, 0, sizeof (rule));
	memset (&amp;cspec, 0, sizeof (cspec));
	while ((c = getoptv (argc, argv, optv)) != -1)
	{
		switch (c)
		{
		case 'T':
			cspec.VLAN_TAG = (uint32_t)(basespec (optarg, 16, sizeof (cspec.VLAN_TAG)));
			cspec.VLAN_TAG = htonl (cspec.VLAN_TAG);
			break;
		case 'V':
			cspec.CSPEC_VERSION = (uint16_t)(basespec (optarg, 10, sizeof (cspec.CSPEC_VERSION)));
			cspec.CSPEC_VERSION = HTOLE16 (cspec.CSPEC_VERSION);
			break;
		default:
			break;
		}
	}
	argc -= optind;
	argv += optind;

#if defined (DUMP_RULE_ARGS)

/*
 *   print arguments on stdout;
 */

	for (c = 0; c &lt; argc; c++)
	{
		printf (&quot;argv [%d] = [%s]\n&quot;, c, argv [c]);
	}

#endif

	if ((argc) &amp;&amp; (*argv))
	{
		ParseRule (&amp;argc, &amp;argv, &amp;rule, &amp;cspec);

#if defined (PRINT_RULES)

/*
 *   print MMERule set on stdout in human readable format; these rules are populated by ParseRule but members
 *   are not PIB ready; they are not properly grouped, byte-aligned or endian-ized;
 */

		MMERuleDump (&amp;rule);

#endif

		if ((rule.NUM_CLASSIFIERS &gt; 1) || (rule.MACTION == ACTION_STRIPTX) || (rule.MACTION == ACTION_STRIPRX) || (rule.MACTION == ACTION_TAGTX) || (classifiers-&gt;priority_count &gt;= RULE_MAX_PRIORITY_MAPS))
		{
			struct auto_connection * auto_connection;
			if (classifiers-&gt;autoconn_count &gt;= RULE_MAX_AUTOCONN)
			{
				error (1, ENOTSUP, &quot;Too many auto connection rules&quot;);
			}
			auto_connection = &amp;classifiers-&gt;auto_connection [classifiers-&gt;autoconn_count];
			auto_connection-&gt;MACTION = rule.MACTION;
			auto_connection-&gt;MOPERAND = rule.MOPERAND;
			auto_connection-&gt;NUM_CLASSIFIERS = HTOLE16 ((uint16_t)(rule.NUM_CLASSIFIERS));
			for (c = 0; c &lt; RULE_MAX_CLASSIFIERS; c++)
			{
				auto_connection-&gt;CLASSIFIER [c].CR_PID = HTOLE32 ((uint32_t)(0xFF));
				auto_connection-&gt;CLASSIFIER [c].CR_OPERAND = HTOLE32 ((uint32_t)(0xFF));
			}
			for (c = 0; c &lt; rule.NUM_CLASSIFIERS; c++)
			{
				auto_connection-&gt;CLASSIFIER [c].CR_PID = HTOLE32 ((uint32_t)(rule.CLASSIFIER [c].CR_PID));
				auto_connection-&gt;CLASSIFIER [c].CR_OPERAND = HTOLE32 ((uint32_t)(rule.CLASSIFIER [c].CR_OPERAND));
				memcpy (auto_connection-&gt;CLASSIFIER [c].CR_VALUE, rule.CLASSIFIER [c].CR_VALUE, sizeof (auto_connection-&gt;CLASSIFIER [c].CR_VALUE));
			}
			memcpy (&amp;auto_connection-&gt;cspec, &amp;rule.cspec, sizeof (auto_connection-&gt;cspec));
			classifiers-&gt;autoconn_count++;
		}
		else
		{
			struct classifier_priority_map * classifier_priority_map;
			if (classifiers-&gt;priority_count &gt;= RULE_MAX_PRIORITY_MAPS)
			{
				error (1, ENOTSUP, &quot;Too many priority map rules&quot;);
			}
			classifier_priority_map = &amp;classifiers-&gt;classifier_priority_map [classifiers-&gt;priority_count];
			classifier_priority_map-&gt;Priority = HTOLE32 ((uint32_t)(rule.MACTION));
			classifier_priority_map-&gt;CLASSIFIER.CR_PID = HTOLE32 ((uint32_t)(rule.CLASSIFIER [0].CR_PID));
			classifier_priority_map-&gt;CLASSIFIER.CR_OPERAND = HTOLE32 ((uint32_t)(rule.CLASSIFIER [0].CR_OPERAND));
			memcpy (classifier_priority_map-&gt;CLASSIFIER.CR_VALUE, rule.CLASSIFIER [0].CR_VALUE, sizeof (classifier_priority_map-&gt;CLASSIFIER.CR_VALUE));
			classifiers-&gt;priority_count++;
		}
	}
	return;
}

/*====================================================================*
 *
 *   int main (int argc, char const * argv[]);
 *
 *
 *--------------------------------------------------------------------*/

int main (int argc, char const * argv [])

{
	static char const * optv [] =
	{
		&quot;eo:qv&quot;,
		&quot;pibfile &lt; rules&quot;,
		&quot;Atheros Classification Rule Insert Utility&quot;,
		&quot;e\tredirect stderr messages to stdout&quot;,
		&quot;o x\talternate offset is (x)&quot;,
		&quot;q\tquiet mode&quot;,
		&quot;v\tverbose mode&quot;,
		(char const *) (0)
	};
	struct PIBClassifiers classifiers;
	char const * vector [24];
	uint32_t offset = 0;
	uint32_t version;
	signed fd;
	signed count;
	flag_t flags = (flag_t)(0);
	signed c;
	optind = 1;
	while ((c = getoptv (argc, argv, optv)) != -1)
	{
		switch (c)
		{
		case 'e':
			dup2 (STDOUT_FILENO, STDERR_FILENO);
			break;
		case 'o':
			offset = (unsigned) (basespec (optarg, 16, sizeof (offset)));
			break;
		case 'q':
			_setbits (flags, PIB_SILENCE);
			break;
		case 'v':
			_setbits (flags, PIB_VERBOSE);
			break;
		default:
			break;
		}
	}
	argc -= optind;
	argv += optind;
	memset (&amp;classifiers, 0, sizeof (classifiers));
	while ((count = getargv (SIZEOF (vector), vector)))
	{
		make_rule (count, vector, &amp;classifiers);
	}
	classifiers.priority_count = HTOLE32 (classifiers.priority_count);
	classifiers.autoconn_count = HTOLE32 (classifiers.autoconn_count);

#if defined (PRINT_CLASSIFIERS)

/*
 *   print PIB-ready classification rules on stdout in human readable format; these rules are written
 *   directly into the appropriate location in the PIB as a single block;
 */

	PIBClassifiersDump (&amp;classifiers);

#endif

#if defined (WRITE_CLASSIFIERS)

	write (STDOUT_FILENO, &amp;classifiers, sizeof (classifiers));

#endif

	while ((argc) &amp;&amp; (*argv))
	{
		if ((fd = open (*argv, O_BINARY|O_RDWR)) == -1)
		{
			error (0, errno, &quot;%s&quot;, *argv);
		}
		else if (read (fd, &amp;version, sizeof (version)) != sizeof (version))
		{
			error (0, errno, FILE_CANTREAD, *argv);
		}
		else if (lseek (fd, 0, SEEK_SET))
		{
			error (0, errno, FILE_CANTHOME, *argv);
		}
		else if (LE32TOH (version) == 0x00010001)
		{
			struct nvm_header2 nvm_header;
			if (!nvmseek2 (fd, *argv, &amp;nvm_header, NVM_IMAGE_PIB))
			{
				pibimage2 (fd, *argv, &amp;nvm_header, offset? offset: PIB_OFFSET2, &amp;classifiers);
			}
		}
		else
		{
			pibimage1 (fd, *argv, offset? offset: PIB_OFFSET1, &amp;classifiers);
		}
		close (fd);
		argc--;
		argv++;
	}
	exit (0);
}


</pre>
		<div class='footerlink'>
			[<a href='pibruin1.c.html' title=' pibruin1.c '>PREV</a>]
			[<a href='toolkit.html' title=' Index '>HOME</a>]
			[<a href='pibrump.c.html' title=' pibrump.c '>NEXT</a>]
			</div>
		</body>
	</html>
